Enter a word or phrase in any language 👆
Language:
Translation and analysis of words by ChatGPT artificial intelligence
On this page you can get a detailed analysis of a word or phrase, produced by the best artificial intelligence technology to date:
- how the word is used
- frequency of use
- it is used more often in oral or written speech
- word translation options
- usage examples (several phrases with translation)
- etymology
cyclic negation - translation to russian
UNARY TRUTH FUNCTION IN MANY-VALUED LOGIC
cyclic negation
математика
циклическое отрицание
cyclic order
TERNARY RELATION THAT IS CYCLIC (IF [𝑥,𝑦,𝑧] THEN [𝑧,𝑥,𝑦]), ASYMMETRIC (IF [𝑥,𝑦,𝑧] THEN NOT [𝑧,𝑦,𝑥]), TRANSITIVE (IF [𝑤,𝑥,𝑦] AND [𝑤,𝑦,𝑧] THEN [𝑤,𝑥,𝑧]) AND CONNECTED (FOR DISTINCT 𝑥,𝑦,𝑧
Cyclic sequence; Circular order; Circular ordering; Total cyclic order; Cyclically ordered set; Cyclic ordering; Complete cyclic order; Linear cyclic order; L-cyclic order; Circularly ordered set
математика
циклический порядок
cyclic order
TERNARY RELATION THAT IS CYCLIC (IF [𝑥,𝑦,𝑧] THEN [𝑧,𝑥,𝑦]), ASYMMETRIC (IF [𝑥,𝑦,𝑧] THEN NOT [𝑧,𝑦,𝑥]), TRANSITIVE (IF [𝑤,𝑥,𝑦] AND [𝑤,𝑦,𝑧] THEN [𝑤,𝑥,𝑧]) AND CONNECTED (FOR DISTINCT 𝑥,𝑦,𝑧
Cyclic sequence; Circular order; Circular ordering; Total cyclic order; Cyclically ordered set; Cyclic ordering; Complete cyclic order; Linear cyclic order; L-cyclic order; Circularly ordered set
ТМО циклический порядок (обслуживания)
Definition
negation by failure
An extralogical feature of Prolog and other {logic
programming} languages in which failure of unification is
treated as establishing the negation of a relation. For
example, if Ronald Reagan is not in our database and we
asked if he was an American, Prolog would answer "no".
(1994-11-29)
Wikipedia
Cyclic negation
In many-valued logic with linearly ordered truth values, cyclic negation is a unary truth function that takes a truth value n and returns n − 1 as value if n is not the lowest value; otherwise it returns the highest value.
For example, let the set of truth values be {0,1,2}, let ~ denote negation, and let p be a variable ranging over truth values. For these choices, if p = 0 then ~p = 2; and if p = 1 then ~p = 0.
Cyclic negation was originally introduced by the logician and mathematician Emil Post.
